Some algebras that are not silting connected
نویسندگان
چکیده
We give examples of finite-dimensional algebras A for which the silting objects in K b ( proj - ) are not connected by any sequence (possibly reducible) mutations. The argument is based on fact that mutation preserves invariance under twisting a fixed algebra automorphism, combined with existence spherical modules invariant such twist.
منابع مشابه
Spaces That Are Connected but Not Path-connected
A topological space X is called connected if it’s impossible to write X as a union of two nonempty disjoint open subsets: if X = U ∪ V where U and V are open subsets of X and U ∩ V = ∅ then one of U or V is empty. Intuitively, this means X consists of one piece. A subset of a topological space is called connected if it is connected in the subspace topology. The most fundamental example of a con...
متن کاملSome Rational Maps Whose Julia Sets Are Not Locally Connected
We describe examples of rational maps which are not topologically conjugate to a polynomial and whose Julia sets are connected but not locally connected. Introduction and motivations The dynamics of a rational map f acting on Ĉ is concentrated on its Julia set which is (by definition) the minimal compact set invariant by f and f−1 containing at least three points. The question of local connecti...
متن کاملMitochondrial DNA barcoding detects some species that are real, and some that are not.
Mimicry and extensive geographical subspecies polymorphism combine to make species in the ithomiine butterfly genus Mechanitis (Lepidoptera; Nymphalidae) difficult to determine. We use mitochondrial DNA (mtDNA) barcoding, nuclear sequences and amplified fragment length polymorphism (AFLP) genotyping to investigate species limits in this genus. Although earlier biosystematic studies based on mor...
متن کاملMulticorns are not path connected
The tricorn is the connectedness locus in the space of antiholomorphic quadratic polynomials z 7! z2 + c. We prove that the tricorn is not locally connected and not even pathwise connected, confirming an observation of John Milnor from 1992. We extend this discussion more generally for antiholomorphic unicritical polynomials of degrees d 2 and their connectedness loci, known as multicorns.
متن کاملSome classes of graphs that are not PCGs
A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that each node u ∈ V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax, where dT (u, v) is the sum of the weights of the edges on the unique path PT (u, v) from u to v in T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2021
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2020.09.028